منابع مشابه
Located Sets and Reverse Mathematics
LetX be a compact metric space. A closed setK ⊆ X is located if the distance function d(x,K) exists as a continuous realvalued function on X ; weakly located if the predicate d(x,K) > r is Σ1 allowing parameters. The purpose of this paper is to explore the concepts of located and weakly located subsets of a compact separable metric space in the context of subsystems of second order arithmetic s...
متن کاملOn linear sets on a projective line
Linear sets generalise the concept of subgeometries in a projective space. They have many applications in finite geometry. In this paper we address two problems for linear sets: the equivalence problem and the intersection problem. We consider linear sets as quotient geometries and determine the exact conditions for two linear sets to be equivalent. This is then used to determine in which cases...
متن کاملComputable Sets: Located and Overt Locales
What is a computable set? One may call a bounded subset of the plane computable if it can be drawn at any resolution on a computer screen. Using the constructive approach to computability one naturally considers totally bounded subsets of the plane. We connect this notion with notions introduced in other frameworks. A subset of a totally bounded set is again totally bounded iff it is located. L...
متن کاملOn - Line Learning from Restricted Training Sets
{ We analyse the dynamics of on-line learning in multilayer neural networks where training examples are sampled with repetition and where the number of examples scales with the number of network weights. The analysis is based on monitoring a set of macroscopic variables from which the training and generalisation errors can be calculated. A closed set of dynamical equations is derived using the ...
متن کاملOn Collinear Sets in Straight-Line Drawings
Given a planar graph G on n vertices, let fix (G) denote the maximum k such that any straight line drawing of G with possible edge crossings can be made crossing-free by moving at most n − k vertices to new positions. Let v̄(G) denote the maximum possible number of collinear vertices in a crossingfree straight line drawing of G. In view of the relation fix (G) ≤ v̄(G), we are interested in exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1981
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1981.95.401